Linear datalog and bounded path duality of relational structures
نویسندگان
چکیده
منابع مشابه
Linear datalog and bounded path duality of relational structures
In this paper we systematically investigate the connections between logics with a nite number of variables, structures of bounded pathwidth, and linear Datalog Programs. We prove that, in the context of Constraint Satisfaction Problems, all these concepts correspond to di erent mathematical embodiments of a unique robust notion that we call bounded path duality. We also study the computational ...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولLearning Hierarchical Structures with Linear Relational Embedding
We present Linear Relational Embedding (LRE), a new method of learning a distributed representation of concepts from data consisting of instances of relations between given concepts. Its final goal is to be able to generalize, i.e. infer new instances of these relations among the concepts. On a task involving family relationships we show that LRE can generalize better than any previously publis...
متن کاملnon-linear study of various slit shear walls in steel structures
seismic retrofit strategies have been developed in the past few decades following the introduction of new seismic provisions and the availability of advanced materials and methods. it can be observed that new approaches to deal with more lateral forces are more innovative and more energy absorbent. in line with this, there is a growing trend toward the use of steel shear walls as a system with ...
15 صفحه اولDatalog on infinite structures
Datalog is the relational variant of logic programming and has become a standard query language in database theory. The (program) complexity of datalog in its main context so far, on finite databases, is well known to be in EXPTIME. We research the complexity of datalog on infinite databases, motivated by possible applications of datalog to infinite structures (e.g. linear orders) in temporal a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2005
ISSN: 1860-5974
DOI: 10.2168/lmcs-1(1:5)2005